Binary Lattice Vector Quantization with Linear Block Codes and Affine Index Assignments
نویسندگان
چکیده
We determine analytic expressions for the performance of some low-complexity combined source-channel coding systems. The main tool used is the Hadamard transform. In particular, we obtain formulas for the average distortion of binary lattice vector quantization with affine index assignments, linear block channel coding, and a binary-symmetric channel. The distortion formulas are specialized to nonredundant channel codes for a binary-symmetric channel, and then extended to affine index assignments on a binary-asymmetric channel. Various structured index assignments are compared. Our analytic formulas provide a computationally efficient method for determining the performance of various coding schemes. One interesting result shown is that for a uniform source and uniform quantizer, the Natural Binary Code is never optimal for a nonsymmetric channel, even though it is known to be optimal for a symmetric channel.
منابع مشابه
Linear code-based vector quantization for independent random variables
The computationally efficient vector quantization for a discrete time source can be performed using lattices over block linear codes or convolutional codes. For high rates (low distortion) and uniform distribution the performance of a multidimensional lattice depends mainly on the normalized second moment (NSM) of the lattice. For relatively low rates (high distortions) and non-uniform distribu...
متن کاملRandomly Chosen Index Assignments Are Asymptotically Bad for Uniform Sources
It is known that among all redundancy-free codes (or index assignments), the natural binary code minimizes the mean-squared error (MSE) of the uniform source and uniform quantizer on a binary symmetric channel. We derive a code which maximizes the MSE and demonstrate that the code is linear and its distortion is asymptotically equivalent, as the blocklength grows, to the expected distortion of ...
متن کاملPerformance of Quantizers on Noisy Channels Using Structured Families of Codes
Achievable distortion bounds are derived for the cascade of structured families of binary linear channel codes and binary lattice vector quantizers. It is known that for the cascade of asymptotically good channel codes and asymptotically good vector quantizers the end-to-end distortion decays to zero exponentially fast as a function of the overall transmission rate, and is achieved by choosing ...
متن کاملOptimal binary index assignments for a class of equiprobable scalar and vector quantizers
The problem of scalar and vector quantization in conjunction with a noisy binary symmetric channel is considered. The issue is the assignment of the shortest possible distinct binary sequences to quantization levels or vectors so as to minimize the mean squared error caused by channel errors. By formulating the assignment as a matrix (or vector in the scalar case) and showing that the mean squa...
متن کاملAsymptotic Bounds on Optimal Noisy Channel Quantization Via Random Coding
Asymptotically optimal zero-delay vector quantization in the presence of channel noise is studied using random coding techniques. First, an upper bound is derived for the average r th-power distortion of channel optimized k-dimensional vector quantization at transmission rate R on a binary symmetric channel with bit error probability. The upper bound asymptoti-cally equals 2 ?rRg(;k;r) , where ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Information Theory
دوره 44 شماره
صفحات -
تاریخ انتشار 1998